NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
481	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
482	Fast Downward Stone Soup: A Baseline for Building Planner Portfolios Malte Helmert and Gabriele R¨oger Erez Karpas University of Freiburg, Germany Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2013-04-30 16:52:25 Theoretical computer science Operations research Heuristics Combinatorial optimization NP-complete problems Greedy algorithm Heuristic function A* search algorithm Algorithm Mathematics Search algorithms Applied mathematics
483	Z310 : Applications, Enablers, Challenges and Directions Nikolaj Bjørner and Leonardo de Moura Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA {nbjorner,leonardo}@microsoft.com Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:10:53 Logic in computer science Metalogic Electronic design automation NP-complete problems Satisfiability Modulo Theories Model theory Formal verification Extended static checking Model checking Theoretical computer science Formal methods Applied mathematics
484	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
485	Alloy: A Higher-Order Relational Constraint Solver Aleksandar Milicevic Joseph P. Near Eunsuk Kang Add to Reading List Source URL: people.csail.mit.edu Language: English* - Date: 2014-09-09 16:16:23 Electronic design automation Formal methods Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories First-order logic Alloy Tree Theoretical computer science Mathematical logic Applied mathematics
486	CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Computational complexity theory Travelling salesman problem Approximation algorithm Linear programming Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
487	Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:17 Analysis of algorithms NP-complete problems Adversary model Gossip protocol Clique Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory
488	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
489	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
490	Solving the (𝒏𝟐 − 𝟏)-Puzzle in Real Time with 𝟖𝟑𝒏𝟑 Expected Moves Ian Parberry Technical Report LARCLaboratory for Recreational Computing Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2014-04-08 15:10:35 Puzzles NP-complete problems Fads Fifteen puzzle Permutations Summation Sudoku algorithms Heuristic function Mathematics Mechanical puzzles Games

UPDATE